extremal circle - vertaling naar russisch
DICLIB.COM
AI-gebaseerde taaltools
Voer een woord of zin in in een taal naar keuze 👆
Taal:     

Vertaling en analyse van woorden door kunstmatige intelligentie

Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:

  • hoe het woord wordt gebruikt
  • gebruiksfrequentie
  • het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
  • opties voor woordvertaling
  • Gebruiksvoorbeelden (meerdere zinnen met vertaling)
  • etymologie

extremal circle - vertaling naar russisch

Extremal graph
  • The edges between parts in a regular partition behave in a "random-like" fashion.
  • The [[Petersen graph]] has chromatic number 3.
  • cliques]]. This is ''T''(13,4).

extremal circle      

математика

экстремальный круг

director circle         
CURVE CONSISTING OF ALL POINTS WHERE TWO PERPENDICULAR TANGENT LINES TO THE ELLIPSE OR HYPERBOLA CROSS EACH OTHER
Fermat–Apollonius circle; Fermat-Apollonius circle; Director Circle

геометрия

окружность направляющая

inner circle         
WIKIMEDIA DISAMBIGUATION PAGE
The inner circle; The Inner circle; The inner Circle; The Inner Circle (movie); The inner circle (film); The Inner Circle (film); Inner circle (disambiguation); Inner Circle; Inner Circle (disambiguation); The Inner Circle; The Inner Circle (novel)

существительное

общая лексика

узкий кружок

Definitie

inner circle
(inner circles)
An inner circle is a small group of people within a larger group who have a lot of power, influence, or special information.
...Mr Blair's inner circle of advisers.
N-COUNT: usu sing, oft N of n

Wikipedia

Extremal graph theory

Extremal graph theory is a branch of combinatorics, itself an area of mathematics, that lies at the intersection of extremal combinatorics and graph theory. In essence, extremal graph theory studies how global properties of a graph influence local substructure. Results in extremal graph theory deal with quantitative connections between various graph properties, both global (such as the number of vertices and edges) and local (such as the existence of specific subgraphs), and problems in extremal graph theory can often be formulated as optimization problems: how big or small a parameter of a graph can be, given some constraints that the graph has to satisfy? A graph that is an optimal solution to such an optimization problem is called an extremal graph, and extremal graphs are important objects of study in extremal graph theory.

Extremal graph theory is closely related to fields such as Ramsey theory, spectral graph theory, computational complexity theory, and additive combinatorics, and frequently employs the probabilistic method.

Vertaling van &#39extremal circle&#39 naar Russisch